import math
possR1 = list(map(int,input().split()))
n = possR1[0]
possR1 = possR1[1:]
nex = list(map(int,input().split()))
m = nex[0]
possP1 = nex[1:]
possP2 = list(map(int,input().split()))
n = possP2[0]
possP2 = possP2[1:]
A, B = map(int,input().split())
ans = 0
possR1.sort()
possP1.sort()
possP2.sort()
r1 = possR1[-1]
p1 = possP1[-1]
p2 = possP2[0]
r2 = math.sqrt((pow(r1,2)*p1*B)/(p2*A + p1*B))
print(r2)
#include<bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define Triple_A iostream::sync_with_stdio(false), cin.tie(NULL),cout.tie(NULL);
#define ll long long
#define ld long double
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define wloop int t; cin>>t; while (t--)
#define f(n) for(int i =0 ; i< n ;i++)
#define END cout<<endl;
#define PI 3.14159265358979323846
#define ordered_set tree<int, null_type,less <int> , rb_tree_tag,tree_order_statistics_node_update>
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define bit(mask,i) ((mask>>i)&1)
typedef pair<ll, ll> iPair;
ll mod =1000000007;
long long mul(long long a, long long b){
return ((a % mod) * (b % mod))%mod;
}
long long add(long long a, long long b){
return ((a % mod) + (b % mod)+ mod )%mod;
}
void files() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
ll const N = 1e5 + 5 ;
int fact[N], inv[N];
void pre() {
fact[0] = inv[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = mul(i, fact[i - 1]);
}
}
void solve(ll tt = 0) {
double n , m , k ;
cin >> n ;
double r1=INT_MIN;
for (int i = 0; i < n; ++i) {
double x;
cin >> x;
r1= max(r1,x);
}
double p1 =INT_MIN;
cin >> n ;
for (int i = 0; i < n; ++i) {
double x;
cin >> x;
p1= max(p1,x);
}
double p2 = INT_MAX;
cin >> n;
for (int i = 0; i < n; ++i) {
double x;
cin >> x;
p2=min(p2,x);
}
double a , b;
cin >> a >> b;
double ans = r1 * sqrt((b*p1)/(b*p1+a*p2));
cout<<fixed<<setprecision(10)<<ans<<endl;
}
int main() {
#ifndef ONLINE_JUDGE
files();
#endif
Triple_A
solve();
}MAXBRIDGE Maximise the bridges | WLDRPL Wildcard Replacement |
1221. Split a String in Balanced Strings | 1002. Find Common Characters |
1602A - Two Subsequences | 1555A - PizzaForces |
1607B - Odd Grasshopper | 1084A - The Fair Nut and Elevator |
1440B - Sum of Medians | 1032A - Kitchen Utensils |
1501B - Napoleon Cake | 1584B - Coloring Rectangles |
1562B - Scenes From a Memory | 1521A - Nastia and Nearly Good Numbers |
208. Implement Trie | 1605B - Reverse Sort |
1607C - Minimum Extraction | 1604B - XOR Specia-LIS-t |
1606B - Update Files | 1598B - Groups |
1602B - Divine Array | 1594B - Special Numbers |
1614A - Divan and a Store | 2085. Count Common Words With One Occurrence |
2089. Find Target Indices After Sorting Array | 2090. K Radius Subarray Averages |
2091. Removing Minimum and Maximum From Array | 6. Zigzag Conversion |
1612B - Special Permutation | 1481. Least Number of Unique Integers after K Removals |